A Simple Solution to the Trivial Crossing Problem in Surface Hopping.

نویسندگان

  • Linjun Wang
  • Oleg V Prezhdo
چکیده

Surface hopping studies on supramolecular and nanoscale systems suffer severely from the trivial crossing problem, arising due to high density of adiabatic potential energy surfaces. We present a straightforward solution to the problem by introducing a self-consistency test to the well-known fewest switches surface hopping (FSSH) procedure. If the test is failed, the hopping probabilities are corrected with a simple procedure. The novel self-consistent fewest switches surface hopping (SC-FSSH) approach is applied to the Holstein Hamiltonian to study the time-dependence of the electron population. Already in the five-state system, SC-FSSH allows us to reduce the simulation time 10(4)-fold to achieve the FSSH accuracy. The reliable performance and simple formulation of SC-FSSH greatly expands the applicability range of the surface hopping method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

Mixed quantum–classical dynamics

We present a uniÐed derivation of the mean-Ðeld (Ehrenfest) and surfacehopping approaches to mixed quantumÈclassical dynamics that elucidates the underlying approximations of the methods and their strengths and weaknesses. We then report a quantitative test of alternative mixed quantumÈclassical methods against accurate quantum mechanical calculations for a simple one-dimensional curve-crossing...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

Generalized trajectory surface-hopping method for internal conversion and intersystem crossing.

Trajectory-based fewest-switches surface-hopping (FSSH) dynamics simulations have become a popular and reliable theoretical tool to simulate nonadiabatic photophysical and photochemical processes. Most available FSSH methods model internal conversion. We present a generalized trajectory surface-hopping (GTSH) method for simulating both internal conversion and intersystem crossing processes on a...

متن کامل

A Diabatic Surface Hopping Algorithm Based on Time Dependent Perturbation Theory and Semiclassical Analysis

Surface hopping algorithms are popular tools to study dynamics of the quantum-classical mixed systems. In this paper, we propose a surface hopping algorithm in diabatic representations, based on time dependent perturbation theory and semiclassical analysis. The algorithm can be viewed as a Monte Carlo sampling algorithm on the semiclassical path space for piecewise deterministic path with stoch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The journal of physical chemistry letters

دوره 5 4  شماره 

صفحات  -

تاریخ انتشار 2014